Stability with Large Step Sizes for Multistep Discretizations of Stiff Ordinary Differential Equations

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stability with Large Step Sizes for Multistep Discretizations of Stiff Ordinary Differential Equations

In this paper we consider a large set of variable coefficient linear systems of ordinary differential equations which possess two different time scales, a slow one and a fast one. A small parameter t characterizes the stiffness of these systems. We approximate a system of ODE's in this set by a general class of multistep discretizations which includes both one-leg and linear multistep methods. ...

متن کامل

Multistep Filtering Operators for Ordinary Differential Equations

Interval methods for ordinary di erential equations (ODEs) provide guaranteed enclosures of the solutions and numerical proofs of existence and unicity of the solution. Unfortunately, they may result in large over-approximations of the solution because of the loss of precision in interval computations and the wrapping e ect. The main open issue in this area is to nd tighter enclosures of the so...

متن کامل

On the Stability and Accuracy of One-Step Methods for Solving Stiff Systems of Ordinary Differential Equations

The stiffness in some systems of nonlinear differential equations is shown to be characterized by single stiff equations of the form y' = g'(x) + \\y g(x)\. The stability and accuracy of numerical approximations to the solution v = g(x), obtained using implicit one-step integration methods, are studied. An S-stability property is introduced for this problem, generalizing the concept of /4-stabi...

متن کامل

Exponential Fitting of Matricial Multistep Methods for Ordinary Differential Equations

We study a class of explicit or implicit multistep integration formulas for solving N X N systems of ordinary differential equations. The coefficients of these formulas are diagonal matrices of order N, depending on a diagonal matrix of parameters Q of the same order. By definition, the formulas considered here are exact with respect to y = Dy + 4>(x, y) provided Q — hD, h is the integration st...

متن کامل

Additive Runge-Kutta Methods for Stiff Ordinary Differential Equations

Certain pairs of Runge-Kutta methods may be used additively to solve a system of n differential equations x' = J(t)x + g(t, x). Pairs of methods, of order p < 4, where one method is semiexplicit and /(-stable and the other method is explicit, are obtained. These methods require the LU factorization of one n X n matrix, and p evaluations of g, in each step. It is shown that such methods have a s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 1986

ISSN: 0025-5718

DOI: 10.2307/2008168